Problem of time - PDFSEARCH.IO - Document Search Engine

Problem of time
Results: 679

#	Item
161	Parameterized Complexity News The Newsletter of the Parameterized Complexity Community fpt.wikidot.com May 2009 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 05:57:59 NP-complete problems Analysis of algorithms Graph coloring Parameterized complexity Complexity classes Kernelization Time complexity Clique problem Vertex cover Theoretical computer science Computational complexity theory Graph theory
162	IOCES 3 Date Time Add to Reading List Source URL: www.pgis.lk Language: English - Date: 2013-02-19 05:37:50 Pedagogy Medical education Philosophy of mind Problem-based learning Education reform Cooperative learning Khon Kaen University Information and communication technologies in education Project-based learning Education Philosophy of education Educational psychology
163	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 On a geometric approach to the segment sum problem and its generalization Asish Mukhopadhyay ∗† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:26:37 Analysis of algorithms Time complexity Algorithm Selection algorithm SL Theoretical computer science Computational complexity theory Applied mathematics
164	Distributed Agreement with Optimal Communication Complexity Seth Gilbert EPFL Abstract We consider the problem of fault-tolerant agreement in Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2009-11-24 09:45:55 Analysis of algorithms Fault-tolerant computer systems Probabilistic complexity theory Consensus Randomized algorithm Distributed algorithm Factorial IP Time complexity Theoretical computer science Computational complexity theory Mathematics
165	Wait and See: A Theory of Communication Over Time Péter Es½oy and Yuk-fai Fongz NovemberAbstract Add to Reading List Source URL: ihome.ust.hk Language: English - Date: 2011-09-16 09:59:35 Communication Cheap talk Bayesian game Thermodynamic equilibrium Economic equilibrium Problem solving Signaling game Game theory Asymmetric information Information
166	Complexity of 10 Decision Problems in Continuous Time Dynamical Systems Amir Ali Ahmadi IBM Watson Research Center Anirudha Majumdar MIT Add to Reading List Source URL: web.mit.edu Language: English - Date: 2013-06-23 10:21:36 Dynamical systems Stability theory Lyapunov function Lyapunov stability Quadratic Polynomial P versus NP problem Time complexity Lyapunov theory Theoretical computer science Mathematics Computational complexity theory
167	Paradox Issue 2, 2003 The Magazine of the Melbourne University Mathematics and Statistics Society Joe Healy Add to Reading List Source URL: www.ms.unimelb.edu.au Language: English - Date: 2011-11-19 03:23:12 Complexity classes Mathematical optimization W. B. R. Lickorish P versus NP problem Travelling salesman problem Time complexity NP Knot theory P Theoretical computer science Computational complexity theory Applied mathematics
168	On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai † Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-15 10:32:13 Operations research Combinatorial optimization NP-complete problems Mathematical optimization Dynamic programming Knapsack problem Job shop scheduling Optimization problem Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
169	SEPTEMBER / OCTOBERbright Making time to think Add to Reading List Source URL: www.edbernacki.com Language: English - Date: 2012-04-02 18:04:37 Cognitive science Thought Educational psychology Problem solving Creativity Idea Mind Cognition Philosophy of mind
170	On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ Ryan Williams† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-11-12 23:47:30 NP-complete problems Logic in computer science Exponential time hypothesis 2-satisfiability Boolean satisfiability problem Conjunctive normal form Time complexity Parameterized complexity Dominating set Theoretical computer science Computational complexity theory Applied mathematics

UPDATE